OPTIMAL ALLOCATION PROBLEM WITH QUADRATIC UTILITY FUNCTIONS AND ITS RELATIONSHIP WITH GRAPH CUT PROBLEM
نویسندگان
چکیده
منابع مشابه
Optimal Allocation Problem with Quadratic Utility Functions and Its Relationship with Graph Cut Problem
We discuss the optimal allocation problem in combinatorial auctions, where the items are allocated to bidders so that the sum of the bidders’ utilities is maximized. In this paper, we consider the case where utility functions are given by quadratic functions; the class of such utility functions has a succinct representation but is sufficiently general. The main aim of this paper is to show the ...
متن کاملOptimal Allocation in Combinatorial Auctions with Quadratic Utility Functions
We discuss the optimal allocation problem in combinatorial auction, where the items are allocated to bidders so that the sum of the bidders’ utilities is maximized. In this paper, we consider the case where utility functions are given by quadratic functions; the class of quadratic utility functions has a succinct representation but is sufficiently general. The main aim of this paper is to show ...
متن کاملThe allocation problem with submodular utility functions (preliminary version)
We consider the problem of maximizing welfare when allocating items to players with submodular utility functions. Our main result is a way of rounding any fractional solution to a linear programming relaxation to this problem so as to give a feasible solution of welfare at least 1−1/e+2 of the value of the fractional solution, where 2 > 0 is some fixed constant. This resolves the question of wh...
متن کاملSolving optimal screening problem with unknown utility functions
Optimal screening is one of the basic models of contracting with private information. We present a numerical method for solving the one-dimensional problem when the principal is uncertain about the agents’ utility functions. We develop a tractable model by making a single-crossing and a convexity assumptions.We show that the principal can acquire enough information about the agents’ utility fun...
متن کاملRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2012
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.55.92